Cluster-based Alpha-Beta Search for Real-Time Strategy Games
نویسندگان
چکیده
منابع مشابه
Hierarchical Adversarial Search Applied to Real-Time Strategy Games
Real-Time Strategy (RTS) video games have proven to be a very challenging application area for artificial intelligence research. Existing AI solutions are limited by vast state and action spaces and real-time constraints. Most implementations efficiently tackle various tactical or strategic sub-problems, but there is no single algorithm fast enough to be successfully applied to big problem sets...
متن کاملExperiments with Game Tree Search in Real-Time Strategy Games
Game tree search algorithms such as minimax have been used with enormous success in turn-based adversarial games such as Chess or Checkers. However, such algorithms cannot be directly applied to real-time strategy (RTS) games because a number of reasons. For example, minimax assumes a turn-taking game mechanics, not present in RTS games. In this paper we present RTMM, a real-time variant of the...
متن کاملCase-based Plan Recognition for Real-time Strategy Games
The current game industry around the world is one of the fastest growing industries. One gaming genre that is very popular is the real-time strategy games. However, current implementations of games apply extensive usage of FSM that makes them highly predictable and provides less replayability. Thus, this paper looks at the possibility of employing case-based plan recognition for NPCs so as to m...
متن کاملCase-Based Planning and Execution for Real-Time Strategy Games
Artificial Intelligence techniques have been successfully applied to several computer games. However in some kinds of computer games, like real-time strategy (RTS) games, traditional artificial intelligence techniques fail to play at a human level because of the vast search spaces that they entail. In this paper we present a real-time case based planning and execution approach designed to deal ...
متن کاملTime-Based Reward Shaping in Real-Time Strategy Games
Real-Time Strategy (RTS) is a challenging domain for AI, since it involves not only a large state space, but also dynamic actions that agents execute concurrently. This problem cannot be optimally solved through general Q-learning techniques, so we propose a solution using a Semi Markov Decision Process (SMDP). We present a time-based reward shaping technique, TRS, to speed up the learning proc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IOP Conference Series: Materials Science and Engineering
سال: 2018
ISSN: 1757-899X
DOI: 10.1088/1757-899x/435/1/012012